Randomly biased walks on subcritical trees
نویسندگان
چکیده
منابع مشابه
Randomly biased walks on subcritical trees
As a model of trapping by biased motion in random structure, we study the time taken for a biased random walk to return to the root of a subcritical Galton-Watson tree. We do so for trees in which these biases are randomly chosen, independently for distinct edges, according to a law that satisfies a logarithmic non-lattice condition. The mean return time of the walk is in essence given by the t...
متن کاملStable limit laws for randomly biased walks on supercritical trees
We consider a random walk on a supercritical Galton-Watson tree with leaves, where the transition probabilities of the walk are determined by biases that are randomly assigned to the edges of the tree. The biases are chosen independently on distinct edges, each one according to a given law that satisfies a logarithmic non-lattice condition. We determine the condition under which the walk is sub...
متن کاملBiased Random Walks on Galton - Watson Trees
We consider random walks with a bias toward the root on the family tree T of a supercritical Galton-Watson branching process and show that the speed is positive whenever the walk is transient. The corresponding harmonic measures are carried by subsets of the boundary of dimension smaller than that of the whole boundary. When the bias is directed away from the root and the extinction probability...
متن کاملSubcritical Galton-Watson Trees
Each variable X is a new, independent Uniform [0, 1] random number. For example, T = ∅ with probability 1−p, T = (∅, ∅) with probability p(1−p)2, and T = ((∅, ∅), ∅) with probability p2(1− p). The number of vertices N is equal to twice the number of left parentheses (parents) in the expression for T , plus one. Equivalently, N is twice the number of ∅s (leaves), minus one. It can be shown that ...
متن کاملBounds on Biased and Unbiased Random Walks
We analyze several random random walks on one-dimensional lattices using spectral analysis and probabilistic methods. Through our analysis, we develop insight into the pre-asymptotic convergence of Markov chains.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications on Pure and Applied Mathematics
سال: 2012
ISSN: 0010-3640
DOI: 10.1002/cpa.21416